0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : run_E %s %d THM 0.12/0.34 % Computer : n010.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 960 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Aug 9 03:03:05 EDT 2022 0.12/0.34 % CPUTime : 0.20/0.45 Running higher-order on 8 cores theorem proving 0.20/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.20/0.46 # Version: 3.0pre003-ho 0.20/0.46 # Preprocessing class: HSMSSMSSMLMNHHN. 0.20/0.46 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.46 # Starting ehoh_best2_full_lfho with 600s (5) cores 0.20/0.46 # Starting lpo9_lambda_fix with 120s (1) cores 0.20/0.46 # Starting sh5l with 120s (1) cores 0.20/0.46 # Starting ho_unfolding_6 with 120s (1) cores 0.20/0.46 # ho_unfolding_6 with pid 28920 completed with status 0 0.20/0.46 # Result found by ho_unfolding_6 0.20/0.46 # Preprocessing class: HSMSSMSSMLMNHHN. 0.20/0.46 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.46 # Starting ehoh_best2_full_lfho with 600s (5) cores 0.20/0.46 # Starting lpo9_lambda_fix with 120s (1) cores 0.20/0.46 # Starting sh5l with 120s (1) cores 0.20/0.46 # Starting ho_unfolding_6 with 120s (1) cores 0.20/0.46 # No SInE strategy applied 0.20/0.46 # Search class: HHUNF-FFSF00-SHHSMFNN 0.20/0.46 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.20/0.46 # Starting new_ho_10 with 65s (1) cores 0.20/0.46 # new_ho_10 with pid 28925 completed with status 0 0.20/0.46 # Result found by new_ho_10 0.20/0.46 # Preprocessing class: HSMSSMSSMLMNHHN. 0.20/0.46 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.46 # Starting ehoh_best2_full_lfho with 600s (5) cores 0.20/0.46 # Starting lpo9_lambda_fix with 120s (1) cores 0.20/0.46 # Starting sh5l with 120s (1) cores 0.20/0.46 # Starting ho_unfolding_6 with 120s (1) cores 0.20/0.46 # No SInE strategy applied 0.20/0.46 # Search class: HHUNF-FFSF00-SHHSMFNN 0.20/0.46 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.20/0.46 # Starting new_ho_10 with 65s (1) cores 0.20/0.46 # Preprocessing time : 0.001 s 0.20/0.46 # Presaturation interreduction done 0.20/0.46 0.20/0.46 # Proof found! 0.20/0.46 # SZS status Theorem 0.20/0.46 # SZS output start CNFRefutation 0.20/0.46 thf(decl_22, type, meq_ind: mu > mu > $i > $o). 0.20/0.46 thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.46 thf(decl_24, type, mnot: ($i > $o) > $i > $o). 0.20/0.46 thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.46 thf(decl_26, type, mand: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.46 thf(decl_27, type, mimplies: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.46 thf(decl_28, type, mimplied: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.46 thf(decl_29, type, mequiv: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.46 thf(decl_30, type, mxor: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.46 thf(decl_31, type, mforall_ind: (mu > $i > $o) > $i > $o). 0.20/0.46 thf(decl_32, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o). 0.20/0.46 thf(decl_33, type, mexists_ind: (mu > $i > $o) > $i > $o). 0.20/0.46 thf(decl_34, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o). 0.20/0.46 thf(decl_35, type, mtrue: $i > $o). 0.20/0.46 thf(decl_36, type, mfalse: $i > $o). 0.20/0.46 thf(decl_37, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o). 0.20/0.46 thf(decl_38, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o). 0.20/0.46 thf(decl_39, type, mreflexive: ($i > $i > $o) > $o). 0.20/0.46 thf(decl_40, type, msymmetric: ($i > $i > $o) > $o). 0.20/0.46 thf(decl_41, type, mserial: ($i > $i > $o) > $o). 0.20/0.46 thf(decl_42, type, mtransitive: ($i > $i > $o) > $o). 0.20/0.46 thf(decl_43, type, meuclidean: ($i > $i > $o) > $o). 0.20/0.46 thf(decl_44, type, mpartially_functional: ($i > $i > $o) > $o). 0.20/0.46 thf(decl_45, type, mfunctional: ($i > $i > $o) > $o). 0.20/0.46 thf(decl_46, type, mweakly_dense: ($i > $i > $o) > $o). 0.20/0.46 thf(decl_47, type, mweakly_connected: ($i > $i > $o) > $o). 0.20/0.46 thf(decl_48, type, mweakly_directed: ($i > $i > $o) > $o). 0.20/0.46 thf(decl_49, type, mvalid: ($i > $o) > $o). 0.20/0.46 thf(decl_50, type, minvalid: ($i > $o) > $o). 0.20/0.46 thf(decl_51, type, msatisfiable: ($i > $o) > $o). 0.20/0.46 thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o). 0.20/0.46 thf(decl_53, type, epred1_0: $i > $i > $o). 0.20/0.46 thf(decl_54, type, esk1_0: $i). 0.20/0.46 thf(decl_55, type, epred2_0: $i > $o). 0.20/0.46 thf(decl_56, type, esk2_0: $i). 0.20/0.46 thf(decl_57, type, esk3_0: $i). 0.20/0.46 thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mimplies)). 0.20/0.46 thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mnot)). 0.20/0.46 thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mor)). 0.20/0.46 thf(mforall_prop, axiom, ((mforall_prop)=(^[X9:($i > $o) > $i > $o, X3:$i]:(![X10:$i > $o]:((X9 @ X10 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mforall_prop)). 0.20/0.46 thf(mbox, axiom, ((mbox)=(^[X13:$i > $i > $o, X6:$i > $o, X3:$i]:(![X14:$i]:((~((X13 @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mbox)). 0.20/0.46 thf(mtransitive, axiom, ((mtransitive)=(^[X13:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((X13 @ X15 @ X16)&(X13 @ X16 @ X17))=>(X13 @ X15 @ X17)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mtransitive)). 0.20/0.46 thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mvalid)). 0.20/0.46 thf(conj, conjecture, ![X13:$i > $i > $o]:(((mtransitive @ X13)=>(mvalid @ (mforall_prop @ (^[X18:$i > $o]:(mimplies @ (mbox @ X13 @ X18) @ (mbox @ X13 @ (mbox @ X13 @ X18)))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj)). 0.20/0.46 thf(c_0_8, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])). 0.20/0.46 thf(c_0_9, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.20/0.46 thf(c_0_10, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])). 0.20/0.46 thf(c_0_11, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8, c_0_9]), c_0_10])). 0.20/0.46 thf(c_0_12, plain, ((mforall_prop)=(^[Z0:($i > $o) > $i > $o, Z1:$i]:(![X10:$i > $o]:((Z0 @ X10 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_prop])). 0.20/0.46 thf(c_0_13, plain, ((mbox)=(^[Z0:$i > $i > $o, Z1:$i > $o, Z2:$i]:(![X14:$i]:((~((Z0 @ Z2 @ X14))|(Z1 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox])). 0.20/0.46 thf(c_0_14, plain, ((mtransitive)=(^[Z0:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((Z0 @ X15 @ X16)&(Z0 @ X16 @ X17))=>(Z0 @ X15 @ X17)))))), inference(fof_simplification,[status(thm)],[mtransitive])). 0.20/0.46 thf(c_0_15, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.20/0.46 thf(c_0_16, negated_conjecture, ~(![X13:$i > $i > $o]:((![X23:$i, X24:$i, X25:$i]:((((X13 @ X23 @ X24)&(X13 @ X24 @ X25))=>(X13 @ X23 @ X25)))=>![X30:$i, X29:$i > $o]:((~(![X26:$i]:((~(X13 @ X30 @ X26)|(X29 @ X26))))|![X28:$i]:((~(X13 @ X30 @ X28)|![X27:$i]:((~(X13 @ X28 @ X27)|(X29 @ X27)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]), c_0_11]), c_0_12]), c_0_13]), c_0_14]), c_0_15])])). 0.20/0.46 thf(c_0_17, negated_conjecture, ![X32:$i, X33:$i, X34:$i, X37:$i]:(((~(epred1_0 @ X32 @ X33)|~(epred1_0 @ X33 @ X34)|(epred1_0 @ X32 @ X34))&((~(epred1_0 @ esk1_0 @ X37)|(epred2_0 @ X37))&((epred1_0 @ esk1_0 @ esk2_0)&((epred1_0 @ esk2_0 @ esk3_0)&~(epred2_0 @ esk3_0)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])). 0.20/0.46 thf(c_0_18, negated_conjecture, ![X14:$i, X3:$i, X15:$i]:(((epred1_0 @ X3 @ X15)|~((epred1_0 @ X3 @ X14))|~((epred1_0 @ X14 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_17])). 0.20/0.46 thf(c_0_19, negated_conjecture, (epred1_0 @ esk2_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_17])). 0.20/0.46 thf(c_0_20, negated_conjecture, ![X3:$i]:(((epred2_0 @ X3)|~((epred1_0 @ esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_17])). 0.20/0.46 thf(c_0_21, negated_conjecture, ![X3:$i]:(((epred1_0 @ X3 @ esk3_0)|~((epred1_0 @ X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_18, c_0_19])). 0.20/0.46 thf(c_0_22, negated_conjecture, (epred1_0 @ esk1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_17])). 0.20/0.46 thf(c_0_23, negated_conjecture, ~((epred2_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.20/0.46 thf(c_0_24, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])]), c_0_23]), ['proof']). 0.20/0.46 # SZS output end CNFRefutation 0.20/0.46 # Parsed axioms : 64 0.20/0.46 # Removed by relevancy pruning/SinE : 0 0.20/0.46 # Initial clauses : 37 0.20/0.46 # Removed in clause preprocessing : 32 0.20/0.46 # Initial clauses in saturation : 5 0.20/0.46 # Processed clauses : 13 0.20/0.46 # ...of these trivial : 0 0.20/0.46 # ...subsumed : 0 0.20/0.46 # ...remaining for further processing : 13 0.20/0.46 # Other redundant clauses eliminated : 0 0.20/0.46 # Clauses deleted for lack of memory : 0 0.20/0.46 # Backward-subsumed : 0 0.20/0.46 # Backward-rewritten : 0 0.20/0.46 # Generated clauses : 5 0.20/0.46 # ...of the previous two non-redundant : 3 0.20/0.46 # ...aggressively subsumed : 0 0.20/0.46 # Contextual simplify-reflections : 0 0.20/0.46 # Paramodulations : 5 0.20/0.46 # Factorizations : 0 0.20/0.46 # NegExts : 0 0.20/0.46 # Equation resolutions : 0 0.20/0.46 # Propositional unsat checks : 0 0.20/0.46 # Propositional check models : 0 0.20/0.46 # Propositional check unsatisfiable : 0 0.20/0.46 # Propositional clauses : 0 0.20/0.46 # Propositional clauses after purity: 0 0.20/0.46 # Propositional unsat core size : 0 0.20/0.46 # Propositional preprocessing time : 0.000 0.20/0.46 # Propositional encoding time : 0.000 0.20/0.46 # Propositional solver time : 0.000 0.20/0.46 # Success case prop preproc time : 0.000 0.20/0.46 # Success case prop encoding time : 0.000 0.20/0.46 # Success case prop solver time : 0.000 0.20/0.46 # Current number of processed clauses : 8 0.20/0.46 # Positive orientable unit clauses : 3 0.20/0.46 # Positive unorientable unit clauses: 0 0.20/0.46 # Negative unit clauses : 1 0.20/0.46 # Non-unit-clauses : 4 0.20/0.46 # Current number of unprocessed clauses: 0 0.20/0.46 # ...number of literals in the above : 0 0.20/0.46 # Current number of archived formulas : 0 0.20/0.46 # Current number of archived clauses : 5 0.20/0.46 # Clause-clause subsumption calls (NU) : 2 0.20/0.46 # Rec. Clause-clause subsumption calls : 2 0.20/0.46 # Non-unit clause-clause subsumptions : 0 0.20/0.46 # Unit Clause-clause subsumption calls : 0 0.20/0.46 # Rewrite failures with RHS unbound : 0 0.20/0.46 # BW rewrite match attempts : 0 0.20/0.46 # BW rewrite match successes : 0 0.20/0.46 # Condensation attempts : 13 0.20/0.46 # Condensation successes : 0 0.20/0.46 # Termbank termtop insertions : 2325 0.20/0.46 0.20/0.46 # ------------------------------------------------- 0.20/0.46 # User time : 0.004 s 0.20/0.46 # System time : 0.002 s 0.20/0.46 # Total time : 0.006 s 0.20/0.46 # Maximum resident set size: 1920 pages 0.20/0.46 0.20/0.46 # ------------------------------------------------- 0.20/0.46 # User time : 0.005 s 0.20/0.46 # System time : 0.004 s 0.20/0.46 # Total time : 0.009 s 0.20/0.46 # Maximum resident set size: 1796 pages 0.20/0.47 EOF